Priority Algorithms
نویسنده
چکیده
This paper reviews the recent development of the formal framework of priority algorithms for scheduling problems [BNR02]; the extension of the model for facility location and set cover [AB02], and graph problems [DI02]. We pose some open questions and directions for future research.
منابع مشابه
The Approximation Power of Priority Algorithms by Spyros Angelopoulos
The Approximation Power of Priority Algorithms Spyros Angelopoulos Doctor of Philosophy Graduate Department of Computer Science University of Toronto 2006 Greedy-like algorithms have been a popular approach in combinatorial optimization, due to their conceptual simplicity and amenability to analysis. Surprisingly, it was only recently that a formal framework for their study emerged. In particul...
متن کاملA fair starvation-free prioritized mutual exclusion algorithm for distributed systems
Several distributed mutual exclusion algorithms define the order in which requests are satisfied based on the priorities assigned to requests. These algorithms are very useful for real-time applications ones or those where priority is associated to a quality of service requirement. However, priority based strategies may result in starvation problems where high priority requests forever prevent ...
متن کاملA Heap-Based Concurrent Priority Queue with Mutable Priorities for Faster Parallel Algorithms
Existing concurrent priority queues do not allow to update the priority of an element after its insertion. As a result, algorithms that need this functionality, such as Dijkstra’s single source shortest path algorithm, resort to cumbersome and inefficient workarounds. We report on a heap-based concurrent priority queue which allows to change the priority of an element after its insertion. We sh...
متن کاملScheduling Algorithms for Real-Time Systems
The problem of real-time scheduling spans a broad spectrum of algorithms from simple uniprocessor to highly sophisticated multiprocessor scheduling algorithms. In this paper, we study the characteristics and constraints of real-time tasks which should be scheduled to be executed. Analysis methods and the concept of optimality criteria, which leads to design appropriate scheduling algorithms, wi...
متن کاملFast Priority Queues for Parallel Branch-and-Bound
Currently used parallel best rst branch-and-bound algorithms either suuer from contention at a centralized priority queue or can only approximate the best rst strategy. Bottleneck free algorithms for parallel priority queues are known but they cannot be implemented very eeciently on contemporary machines. We present quite simple randomized algorithms for parallel priority queues on distributed ...
متن کاملGrid Jobs Scheduling Improvement Using Priority Rules and Backfilling
Over the past decade, scheduling in grid computing system has been an active research. However, it is still difficult to find an optimal scheduling algorithm to achieve load balancing. Most of the researchers have focus on schedule-based algorithms such as genetic algorithm and particle swarm optimization to solve this problem and us e priority rules algorithms as initial schedule in those algo...
متن کامل